The lexicographically least word in the orbit closure of the Rudin-Shapiro word
نویسنده
چکیده
We show that the lexicographically least word in the orbit closure of the Rudin-Shapiro word w is 0w.
منابع مشابه
Extremal words in morphic subshifts
Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order σ on A, we call the smallest word with respect to σ starting with b in the shift orbit closure of x an extremal word of x. In this paper we consider the extremal words of morphic words. If x = g(fω(a)) for some morphisms f and g, we give two simple conditions on f and g that guarantees that all extremal wo...
متن کاملAvoiding squares and overlaps over the natural numbers
We consider avoiding squares and overlaps over the natural numbers, using a greedy algorithm that chooses the least possible integer at each step; the word generated is lexicographically least among all such infinite words. In the case of avoiding squares, the word is 01020103 · · · , the familiar ruler function, and is generated by iterating a uniform morphism. The case of overlaps is more cha...
متن کاملAvoiding fractional powers over the natural numbers
We study the lexicographically least infinite a/b-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least 7/4-power-free word is a fixed point of a 50847-uniform morphism. We identify the structure of the lexicographically least a/b-power-free word for three infinit...
متن کاملThe Effect of Word-Of-Mouth Advertisements on the Responses of Clients (Case Study: Mobile Operators)
Customer reviews in social media contain valuable electronic word-of-mouth (eWOM) information of products, which facilitates firms’ business strategy and individual consumers’ comparison shopping. This study examined the effects of eWOM motivations on customers’ behavioral intentions in the Mobile operators setting. eWOM advertising is very important because nowadays many customer buying decisi...
متن کاملExtremal Innnite Overlap-free Binary Words
Let t be the innnite xed point, starting with 1, of the morphism : 0 ! 01, 1 ! 10. An innnite word over f0;1g is said to be overlap-free if it contains no factor of the form axaxa, where a 2 f0;1g and x 2 f0;1g. We prove that the lexicographically least innnite overlap-free binary word beginning with any speciied preex, if it exists, has a suux which is a suux of t. In particular, the lexicogra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0905.4923 شماره
صفحات -
تاریخ انتشار 2009